Optimization problem

Results: 1483



#Item
71PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Add to Reading List

Source URL: users.eecs.northwestern.edu

Language: English - Date: 2009-09-15 22:21:32
72Grenoble Optimization Day November 5, LJK, Université Joseph Fourier, Grenoble, France How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem —

Grenoble Optimization Day November 5, LJK, Université Joseph Fourier, Grenoble, France How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem —

Add to Reading List

Source URL: bipop.inrialpes.fr

Language: English - Date: 2014-11-07 11:21:24
73Revenue Maximization in the Dynamic Knapsack Problem Deniz Dizdar, Alex Gershkov and Benny MoldovanuAbstract

Revenue Maximization in the Dynamic Knapsack Problem Deniz Dizdar, Alex Gershkov and Benny MoldovanuAbstract

Add to Reading List

Source URL: www.econ2.uni-bonn.de

Language: English - Date: 2014-03-26 06:49:17
74Exploring Unknown Environments with Obstacles Susanne Albers Klaus Kursawey  Sven Schuiererz

Exploring Unknown Environments with Obstacles Susanne Albers Klaus Kursawey Sven Schuiererz

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:05:22
75Nordic Collegiate Programming Contest NCPC 2007 October 6th, 2007 Solution sketches A B

Nordic Collegiate Programming Contest NCPC 2007 October 6th, 2007 Solution sketches A B

Add to Reading List

Source URL: ncpc.idi.ntnu.no

Language: English - Date: 2016-08-21 12:25:59
7665  Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

65 Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2012-07-25 10:24:42
77Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas

Using Strong Triadic Closure to Characterize Ties in Social Networks Stavros Sintos Panayiotis Tsaparas

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2014-09-25 06:28:22
78Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Fast Routing Table Construction Using Small Messages ∗ [Extended Abstract] †

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:12
79Sequential Encodings from Max-CSP into Partial Max-SAT⋆ Josep Argelich1 , Alba Cabiscol2 , Inˆes Lynce3 , and Felip Many`a4 1  2

Sequential Encodings from Max-CSP into Partial Max-SAT⋆ Josep Argelich1 , Alba Cabiscol2 , Inˆes Lynce3 , and Felip Many`a4 1 2

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55
80What Works Best When? A Framework for Systematic Heuristic Evaluation Iain Dunning, Swati Gupta, John Silberholz Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139 , sw

What Works Best When? A Framework for Systematic Heuristic Evaluation Iain Dunning, Swati Gupta, John Silberholz Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139 , sw

Add to Reading List

Source URL: www.optimization-online.org

Language: English - Date: 2015-05-04 12:28:03